-
1 доказательство (правильности) алгоритма
Makarov: algorithm proofУниверсальный русско-английский словарь > доказательство (правильности) алгоритма
-
2 доказательство алгоритма
Makarov: (правильности) algorithm proofУниверсальный русско-английский словарь > доказательство алгоритма
-
3 Отсутствие артиклей перед существительными, которые снабжены ссылками
It follows from Theorem 1 that $x=1$Section 2 of this paper gives (contains) a concise presentation of the notation to be used belowProperty 1 is called (known as) the triangle inequalityThis assertion (statement, proposition) has been proved in part 1 (part (a)) of the (our) proofAlgorithm 1 (с большой буквы) defines elementary permutations and elementary triangle matrices of index 2Equation (1) ((the) inequality (1)) can thus be written in the (артикль обязателен) form (2)In the language of our notation, algorithm (1) (с маленькой буквы) is a stable way of computing the inner productThe only place where the algorithm can break down is in statement 3 (in Statement 3)We combine Exercises 1 and 2 to construct an algorithm for finding an approximate eigenvectorThis case is illustrated in (но не on) Figure 1The asymptotic formula (1) was proved in Example 1Corollary 1 can be used to estimate the error in the inverse of a perturbed matrixBy property 1 (by Theorem 1), this function is positive except at the zero vectorA less trivial example is given in Appendix 3Step 1 in Example 1 and steps 2 and 3 in Example 2The idea of a norm will be introduced in Chapter 4Now from statements 2 and 3 of (1), we have...All the drivers for solving linear systems are listed in Table 1 (are illustrated in Figure 1)If Algorithm 1 in four-digit arithmetic is applied to refine $x$, then we obtain...Assertion (ii) is nothing but the statement that one natural way of extending these ideas to $R^n$ is to generalize formula (1) to obtain a Euclidean length of a vectorBy property 1, this function is positive except at the zero vectorWe have seen on page 3 that set of matrices is a vector space which is essentially identical with...Equation (1) effectively gives an algorithm for using the output of Algorithm 1 to solve...Русско-английский словарь по прикладной математике и механике > Отсутствие артиклей перед существительными, которые снабжены ссылками
-
4 криптостойкий алгоритм
Security: attack-proof cryptoalgorithm, strong algorithmУниверсальный русско-английский словарь > криптостойкий алгоритм
-
5 В том смысле, что
The proof of the theorem is constructive in that it actually suggests an algorithm for computing the factorizationThis method has the advantage over capacitance methods in that it does not require differentiation to obtain...The computer is only automatic in the sense that it can deal with explicit instructionsРусско-английский словарь по прикладной математике и механике > В том смысле, что
См. также в других словарях:
Proof-Number-Suche — (kurz: PN Suche) bzw. Beweiszahlsuche ist ein Spielbaum Suchalgorithmus, erfunden von Victor Allis, ursprünglich zur Lösung der Spiele Vier gewinnt, Qubic (1990). Anwendungen sind hauptsächlich in der Endspiel Lösung und für Teilziele während des … Deutsch Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Proof of impossibility — A proof of impossibility, sometimes called a negative proof or negative result , is a proof demonstrating that a particular problem cannot be solved, or cannot be solved in general. Often proofs of impossibility have put to rest decades or… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
Proof complexity — In computer science, proof complexity is a measure of efficiency of automated theorem proving methods that is based on the size of the proofs they produce. The methods for proving contradiction in propositional logic are the most analyzed. The… … Wikipedia
Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… … Wikipedia
algorithm — Initially a word with equivalent meaning to formula, but under the influence of computing now regarded as a step by step procedure to solve a problem, usually supported by a mathematical proof. In sociology, the term is generally used more… … Dictionary of sociology
DPLL algorithm — The Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking based algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF SAT problem. It was introduced in … Wikipedia
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
Division algorithm — This article is about a mathematical theorem. For a list of division algorithms, see Division (digital). In mathematics, and more particularly in arithmetic, the usual process of division of integers producing a quotient and a remainder can be… … Wikipedia
Cipolla's algorithm — In computational number theory, Cipolla s algorithm is a technique for solving a congruence of the form x2 = n, where , so n is the square of x, and where p is an odd prime. Here denotes the finite field with p elements; . Th … Wikipedia
